On Weil sums, conjectures of Helleseth, and Niho exponents
نویسندگان
چکیده
Let F be a finite field, μ fixed additive character and s an integer coprime to |F×|. For any a∈F, the corresponding Weil sum is defined WF,s(a)=∑x∈Fμ(xs−ax). The spectrum counts distinct values of as runs through invertible elements in field. value these sums size are particular interest, they link problems coding information theory other areas math such number arithmetic geometry. In setting Niho exponents, we examine sum, its bounds spectrum. As consequence, give new proof Vanishing Conjecture Helleseth (1971) on presence zero case exponents. We also state conjecture for when contains at least five elements, prove it certain class sums.
منابع مشابه
The Weil Conjectures
The Weil conjectures constitute one of the central landmarks of 20th century algebraic geometry: not only was their proof a dramatic triumph, but they served as a driving force behind a striking number of fundamental advances in the field. The conjectures treat a very elementary problem: how to count the number of solutions to systems of polynomial equations over finite fields. While one might ...
متن کاملHypersurfaces and the Weil conjectures
We give a proof that the Riemann hypothesis for hypersurfaces over finite fields implies the result for all smooth proper varieties, by a deformation argument which does not use the theory of Lefschetz pencils or the `-adic Fourier transform.
متن کاملWeil Conjectures (Deligne’s Purity Theorem)
Let κ = Fq be a finite field of characteristic p > 0, and k be a fixed algebraic closure of κ. We fix a prime ` 6= p, and an isomorphism τ : Q` → C. Whenever we want to denote something (e.g. scheme, sheaf, morphism, etc.) defined over κ, we will put a subscript 0 (e.g. X0 is a scheme over κ, F0 is a Weil sheaf defined over X0, etc.), and when the subscript is dropped, this means the correspond...
متن کاملSeveral generalizations of Weil sums
We consider several generalizations and variations of the character sum inequalities of Weil and Burgess. A number of incomplete character sum inequalities are proved while further conjectures are formulated. These inequalities are motivated by extremal graph theory with applications to problems in computer science.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2022
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2021.06.022